By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 35, Issue 3, pp. 519-785

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time

Klaus Jansen and Lorant Porkolab

pp. 519-530

BibTeX  Abstract Full Text:  PDF

Optimal Covering Tours with Turn Costs

Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, and Saurabh Sethia

pp. 531-566

BibTeX  Abstract Full Text:  PDF

On the Complexity of Network Synchronization

Darin Goldstein and Kojiro Kobayashi

pp. 567-589

BibTeX  Abstract Full Text:  PDF

Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem

Ernst-Erich Doberkat

pp. 590-626

BibTeX  Abstract Full Text:  PDF

Sublinear Geometric Algorithms

Bernard Chazelle, Ding Liu, and Avner Magen

pp. 627-646

BibTeX  Abstract Full Text:  PDF

Lowness for the Class of Schnorr Random Reals

Bjorn Kjos-Hanssen, André Nies, and Frank Stephan

pp. 647-657

BibTeX  Abstract Full Text:  PDF

An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

Minming Li and Frances F. Yao

pp. 658-671

BibTeX  Abstract Full Text:  PDF

A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem

Michael Elkin and Guy Kortsarz

pp. 672-689

BibTeX  Abstract Full Text:  PDF

The Computational Complexity of Tutte Invariants for Planar Graphs

Dirk Vertigan

pp. 690-712

BibTeX  Abstract Full Text:  PDF

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Chandra Chekuri and Sanjeev Khanna

pp. 713-728

BibTeX  Abstract Full Text:  PDF

The Rectilinear Steiner Arborescence Problem Is NP-Complete

Weiping Shi and Chen Su

pp. 729-740

BibTeX  Abstract Full Text:  PDF

Mapping Cycles and Trees on Wrap-Around Butterfly Graphs

Meghanad D. Wagh and Osman Guzide

pp. 741-765

BibTeX  Abstract Full Text:  PDF

WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors

Hung Q. Ngo

pp. 766-785

BibTeX  Abstract Full Text:  PDF